The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs

The Voronoi diagram is a certain geometric data structure which has found numerous applications in various scientific and technological fields. theory of algorithms for computing 2D Euclidean diagrams point sites rich useful, with several different important algorithms. However, this been quite steady during the last few decades sense that no essentially new have entered game. In addition, most known are serial nature hence cast inherent difficulties on possibility to compute parallel. paper we present projector algorithm: simple algorithm enables (combinatorial) computation diagrams. significantly from previous ones some involved concepts it spirit linear programming optics. Parallel implementation naturally supported since each cell (actually, even just portions one cell) can be computed independently other cells. A combinatorial representing cells (and any convex polytope) described along way induced Delaunay graph obtained almost automatically.